翻訳と辞書 Words near each other ・ Integer ・ Integer (computer science) ・ Integer BASIC ・ Integer broom topology ・ Integer circuit ・ Integer complexity ・ Integer factorization ・ Integer factorization records ・ Integer function ・ Integer lattice ・ Integer literal ・ Integer matrix ・ Integer Matrix Library ・ INTEGER Millennium House ・ Integer overflow ・ Integer points in convex polyhedra ・ Integer programming ・ Integer relation algorithm ・ Integer sequence ・ Integer sequence prime ・ Integer set library ・ Integer sorting ・ Integer square root ・ Integer triangle ・ Integer-valued function ・ Integer-valued polynomial ・ Intego ・ Integra ・ Integra Air ・ Integra Bank Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Integer points in convex polyhedra ： ウィキペディア英語版 Integer points in convex polyhedra Study of integer points in convex polyhedra〔In some contexts convex polyhedra are called simply "polyhedra".〕 is motivated by the questions, such as "how many nonnegative integer-valued solutions does a system of linear equations with nonnegative coefficients have" or "how many solutions does an integer linear program have". Counting integer points in polyhedra or other questions about them arise in representation theory, commutative algebra, algebraic geometry, statistics, and computer science.〔(Integer points in polyhedra. Geometry, Number Theory, Representation Theory, Algebra, Optimization, Statistics ), ACM--SIAM Joint Summer Research Conference, 2006〕 The set of integer points, or, more generally, the set of points of an affine lattice, in a polyhedron is called Z-polyhedron,〔The term "Z-polyhedron" is also used as a synonym to convex lattice polytope, the convex hull of finitely many points in an affine lattice.〕 from the mathematical notation $\backslash mathbb$ or Z for the set of integer numbers.〔"Computations on Iterated Spaces" in: The Compiler Design Handbook: Optimizations and Machine Code Generation, CRC Press 2007, 2nd edition, ISBN 1-4200-4382-X, (p.15-7 )〕 ==Properties== For a lattice Λ, Minkowski's theorem relates the number d(Λ) and the volume of a symmetric convex set ''S'' to the number of lattice points contained in ''S''. The number of lattice points contained in a polytope all of whose vertices are elements of the lattice is described by the polytope's Ehrhart polynomial. Formulas for some of the coefficients of this polynomial involve d(Λ) as well. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Integer points in convex polyhedra」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.